Movement-Based Mobility Management and Trade Off Analysis for Wireless Mobile Networks

نویسنده

  • Yuguang Fang
چکیده

Mobility management plays a central role in providing ubiquitous communications services in future wireless mobile networks. In mobility management, there are two key operations, location update and paging, commonly used in tracking mobile users on the move. Location update is to inform the network about a mobile user’s current location, while paging is used for the network to locate a mobile user. Both operations will incur signaling traffic in the resource limited wireless networks. The more frequent the location updates, the less paging in locating a mobile user; thus, there is a trade off in terms of signaling cost. Most trade off analysis in the literature is carried out under the assumption that some time variables are exponentially distributed. However, such assumptions will not be valid, particularly for the wireless Internet. In this paper, we present some general analytical results without these assumptions, which are essential for the general trade off analysis. Specifically, we analytically derive the average number of location updates during the interservice time for a movement-based location update scheme under fairly realistic assumptions, which are crucial for all trade off analysis. Our general analytical results make thorough numerical analysis for finding the optimal mobility management under various network operation scenarios possible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient symmetric polynomial-based key establishment protocol for wireless sensor networks

An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...

متن کامل

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

Mobility Support for IPv6-based Next Generation Wireless Networks: A Survey of Related Protocols

This paper presents an overview of IPv6-based mobility management protocols: mobile IPv6 (MIPv6), fast handovers for mobile IPv6 (FMIPv6), hierarchical mobile IPv6 (HMIPv6), and fast handover for hierarchical mobile IPv6 (F-HMIPv6). All these protocols play an important role in the next generation wireless networks, because in such networks, mobile users need to be freely change their access ne...

متن کامل

A multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks

The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2003